ADDITIVE AND DIVISIVE CLUSTER ALGORITHM FOR COST REDUCTION IN UNIT COMMITMENT
نویسندگان
چکیده
منابع مشابه
Solution sensitivity-based scenario reduction for stochastic unit commitment
A two-stage stochastic program is formulated for day-ahead commitment of thermal generating units to minimize total expected cost considering uncertainties in the day-ahead load and the availability of variable generation resources. Commitments of thermal units in the stochastic reliability unit commitment (SRUC) are viewed as first-stage decisions, and dispatch is relegated to the second stage...
متن کاملSolving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm
One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA). Simula...
متن کاملDecomposition algorithm for large-scale two-stage unit-commitment
Everyday, electricity generation companies submit a generation schedule to the grid operator for the coming day; computing an optimal schedule is called the unit-commitment problem. Generation companies can also occasionally submit changes to the schedule, that can be seen as intra-daily incomplete recourse actions. In this paper, we propose a two-stage formulation of unit-commitment, wherein b...
متن کاملStructured Genetic Algorithm Technique for Unit Commitment Problem
This paper presents and identifies alternative strategies with the advantages of Genetic Algorithm for solving the Thermal Unit Commitment (UC) problem. A Parallel Structure has been developed to handle the infeasibility problem in a structured and improved Genetic Algorithm (GA) which provides an effective search and therefore greater economy. In addition, this proposed method lead us to obtai...
متن کاملA New Heuristic Algorithm for Unit Commitment Problem
Large scale power systems Unit Commitment (UC) is a complicated, hard limit, mixed integer combinatorial and nonlinear optimization problem with many constraints. This paper presents an innovative and effective solution based on modification of the Harmony Search (HS) Algorithm to solve the strategic planning of Generating unit's commitment. The proposed algorithm is easy in application compare...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Electrotechnica et Informatica
سال: 2016
ISSN: 1335-8243,1338-3957
DOI: 10.15546/aeei-2016-0031